Find Minimum of Rotated Array ​
Find Minimum of Rotated Array — LeetCode
Find the minimum element of a sorted array that has been rotated at an unknown pivot, in O(log n).
Approach ​
Get mid, check which part is sorted. Check whether l has lower value or r has lower value, and move it towards there.